Parameterized complexity - PDFSEARCH.IO - Document Search Engine

Parameterized complexity
Results: 172

#	Item
161	PROFESSIONAL CONTRIBUTIONS Area Editor for the Journal of Computer and System Sciences. Advising Editor for the Special Section on Parameterized Complexity in the Journal of Computer and System Sciences. Associate Editor Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-20 08:50:58 Academia Michael Fellows Germany Alexander von Humboldt University of Jena
162	Michael Ralph Fellows My Publications by Year Please also see DBLP AUTHOR Michael Fellows Books This is Mega-Mathematics!, 134 pp., available for free at the World Wide Web site: http://www.c3.lan Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-21 11:20:05 NP-complete problems Parameterized complexity Analysis of algorithms Michael Fellows Kernelization Feedback vertex set Vertex cover Lecture Notes in Computer Science Clique Theoretical computer science Computational complexity theory Applied mathematics
163	STACS 2009 Program Thursday 26 February 8:00 Registration Foyer of Building 101 Add to Reading List Source URL: stacs2009.informatik.uni-freiburg.de Language: English - Date: 2009-02-23 10:01:06 Analysis of algorithms Complexity classes Parameterized complexity Kernelization Graph coloring Kolmogorov complexity Algorithm Complexity SC Theoretical computer science Computational complexity theory Applied mathematics
164	Not So Easy Problems For Tree Decomposable Graphs Stefan Szeider∗ Add to Reading List Source URL: www.kr.tuwien.ac.at Language: English - Date: 2009-11-19 11:09:35 NP-complete problems Graph operations Tree decomposition Minor Parameterized complexity Dominating set Chordal graph Equitable coloring Clique Graph theory Theoretical computer science Graph coloring
165	More Efficient Algorithms for Closest String and Substring Problems Bin Ma1 and Xiaoming Sun2 Add to Reading List Source URL: www.csd.uwo.ca Language: English - Date: 2008-03-04 00:32:19 Complexity classes Analysis of algorithms NP-complete problems Approximation algorithms Closest string Polynomial-time approximation scheme Parameterized complexity Time complexity String Theoretical computer science Computational complexity theory Applied mathematics
166	On the possibility of faster SAT algorithms Mihai Pˇatra¸scu∗ AT&T Labs Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2009-11-12 23:47:30 NP-complete problems Logic in computer science Exponential time hypothesis 2-satisfiability Boolean satisfiability problem Conjunctive normal form Time complexity Parameterized complexity Dominating set Theoretical computer science Computational complexity theory Applied mathematics
167	PDF Document Add to Reading List Source URL: erikdemaine.org Language: English - Date: 2004-10-18 03:25:13 NP-complete problems Analysis of algorithms Parameterized complexity Planar graphs Graph operations Bidimensionality Apex graph Tree decomposition Dominating set Graph theory Theoretical computer science Mathematics
168	PDF Document Add to Reading List Source URL: www.staff.science.uu.nl Language: English - Date: 2013-05-07 06:10:38 Graph operations Michael Fellows Algorithm Path decomposition Jan van Leeuwen Computational complexity theory Tree decomposition Parameterized complexity Discrete mathematics Graph theory Theoretical computer science Mathematics
169	PDF Document Add to Reading List Source URL: theinf1.informatik.uni-jena.de Language: English - Date: 2007-02-16 07:21:01 Complexity classes NP-complete problems Closest string Parameterized complexity Clique problem Vertex cover Polynomial-time approximation scheme String Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
170	PDF Document Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 06:30:58 Analysis of algorithms Parameterized complexity Kernelization Michael Fellows Time complexity Topological sorting International Colloquium on Automata Languages and Programming Directed acyclic graph NP-complete Theoretical computer science Applied mathematics Computational complexity theory

UPDATE